A Simplex-Like Algorithm for the Continuous Modular Design Problem
نویسندگان
چکیده
This paper derives an efficient solution procedure for solving the continuous version of the Evans modular design problem. The Kuhn-Tucker conditions are used to derive a dual problem which can be solved easily and whose dual variables indicate which equations should be tight. The technique retains a tree-basic solution throughout so that fast solution routines can be employed which are quite similar to tho'e for transportation problems. Because of these analogies, the solution of transportation size problems can be effected with only moderately increased computer time.
منابع مشابه
A Continuous Optimization Model for Partial Digest Problem
The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملOptimal Multiple Module Design - An Extended Simplex-like Method
Multiple Modular Design (MMD) is the method of designing a set of standard modules to meet demands for di erent functions. This work aims to nd an optimal set of modules given the demands. In this paper, we start with Evans' nonlinear programming model of MMD. By exploring the special structure of the formulation, we develop several properties of optimal solutions. With these properties, we dev...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 25 شماره
صفحات -
تاریخ انتشار 1977